Sharper ABC-based bounds for congruent polynomials
نویسندگان
چکیده
منابع مشابه
Sharper ABC-based bounds for congruent polynomials
Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The speed of the Agrawal-Kayal-Saxena method depends on proven lower bounds for the size of the multiplicative semigroup generated by several polynomials modulo another polynomial h. Voloch pointed out an application of the Stothers-Mason ABC theorem in this context: under mild assumptions, distinct...
متن کاملSharper Bounds for Regularized Data Fitting
We study matrix sketching methods for regularized variants of linear regression, low rank approximation, and canonical correlation analysis. Our main focus is on sketching techniques which preserve the objective function value for regularized problems, which is an area that has remained largely unexplored. We study regularization both in a fairly broad setting, and in the specific context of th...
متن کاملSharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
The Rényi divergence is a measure of divergence between distributions. It has recently found several applications in lattice-based cryptography. The contribution of this paper is twofold. First, we give theoretic results which renders it more efficient and easier to use. This is done by providing two lemmas, which give tight bounds in very common situations – for distributions that are tailcut ...
متن کاملTiling triangle ABC with congruent triangles similar to ABC
We investigate the problem of cutting a triangle ABC into N congruent triangles (the “tiles”), each of which is similar to ABC. The more general problem when the tile is not similar to ABC is not treated in this paper; see [1]. We give a complete characterization of the numbers N for which some triangle ABC can be tiled by N tiles similar to ABC, and also a complete characterization of the numb...
متن کاملSharper Bounds for Regression and Low-Rank Approximation with Regularization
We study matrix sketching methods for regularized variants of linear regression, low rank approximation, and canonical correlation analysis. Our main focus is on sketching techniques which preserve the objective function value for regularized problems, which is an area that has remained largely unexplored. We study regularization both in a fairly broad setting, and in the specific context of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2005
ISSN: 1246-7405
DOI: 10.5802/jtnb.515